Theory Comparison for Generalized Quantifiers

نویسندگان

  • Marco Ragni
  • Henrik Singmann
  • Eva-Maria Steinlein
چکیده

Premises and conclusions in classical syllogistic reasoning are formed using one of four quantifiers (All, Some, Some not, None). In everyday communication and reasoning, however, statements such as “most” and “few” are formed as well. So far only Chater and Oaksford’s (1999) Probability Heuristics Model (PHM) makes predictions for these so-called generalized quantifiers. In this article we (i) extend existing and develop new theories, (ii) develop multinomial processing tree (MPT) models for these theories, and (iii) conduct an experiment to test the models. The models are evaluated with G2, Akaike’s (AIC) and Bayesian Information Criteria (BIC), and Fisher’s Information Approximation (FIA). Mental modelbased accounts and PHM provide an equal account to the data.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Neural basis for generalized quantifier comprehension.

Generalized quantifiers like "all cars" are semantically well understood, yet we know little about their neural representation. Our model of quantifier processing includes a numerosity device, operations that combine number elements and working memory. Semantic theory posits two types of quantifiers: first-order quantifiers identify a number state (e.g. "at least 3") and higher-order quantifier...

متن کامل

The analysis of the generalized square of opposition

In this paper, we continue the development of a formal theory of intermediate quantifiers (linguistic expressions such as “most”, “many”, “few”, “almost all”, etc.). In previous work, we demonstrated that 105 generalized syllogisms are valid in our theory. We turn our attention to another problem which is the analysis of the generalized Aristotelian square of opposition which, besides the class...

متن کامل

Computational semantics for monadic quantifiers

The paper gives a survey of known results related to computational devices (finite and push–down automata) recognizing monadic generalized quantifiers in finite models. Some of these results are simple reinterpretations of descriptive—feasible correspondence theorems from finite–model theory. Additionally a new result characterizing monadic quantifiers recognized by push down automata is proven...

متن کامل

Interpretation and Processing Time of Generalized Quantifiers: Why your Mental Space Matters

Classical quantifiers (e.g., “all”, “some” and “none”) have been extensively studied in logic and psychology. In contrast, generalized quantifiers (e.g., “most”) allow for fine-grained statements about quantities. The discrepancy in the underlying mental representation and its interpretation among interpreters can affect language use and reasoning. We investigated the effect of quantifier type,...

متن کامل

Monadic L-fuzzy Quantifiers of the Type <1n,1>

The aim of this paper is to introduce monadic L-fuzzy quantifiers of the type 〈1, 1〉 and to investigate some of their semantic properties that are well-known in the generalized quantifier theory. Further, some relations between the semantic properties of generalized quantifiers are also studied for monadic L-fuzzy quantifiers. Finally, a property “to be extensional w.r.t. a given L-permutation ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014